We study the M/D/1 queue when jobs have firm deadlines for waiting (or sojourn) time. If a deadline is not met, a job-specific deadline violation cost is incurred. We derive explicit value functions for this M/D/1 queue that enable the development of efficient cost-aware dispatching policies to parallel servers. The performance of the resulting dispatching policies is evaluated by means of simulations.
展开▼
机译：当作业有确定的等待（或逗留）时间期限时，我们研究M / D / 1队列。如果未满足最后期限，则会产生特定于工作的违反期限的费用。我们为此M / D / 1队列派生了显式的价值函数，这些函数能够为并行服务器开发有效的成本感知调度策略。通过模拟评估生成的调度策略的性能。
展开▼
